Graphs with large total angular resolution

The total angular resolution of a straight-line drawing is the minimum angle between two edges drawing. It combines properties contributing to readability drawing: resolution, which incident edges, and crossing edges. We consider graph, maximum this graph. prove that, up finite number well specified exceptions constant size, graph with $n$ vertices greater than $60^{\circ}$ bounded by $2n-6$. This bound tight. In addition, we show that deciding whether has at least NP-hard.